Sub-Graph Based Joint Sparse Graph for Sparse Code Multiple Access Systems
نویسندگان
چکیده
منابع مشابه
Joint sparse graph for FBMC/OQAM systems
As an advanced non-orthogonal multiple access (NOMA) technique, the low density signature (LDS) has never been used in filter bank multicarrier (FBMC) systems. In this paper, we model a low density weight matrix (LDWM) to utilize the intrinsic interference in FBMC systems when single-tap equalization is employed, and propose a LDS-FBMC scheme which applies LDS to FBMC signals. In addition, a jo...
متن کاملFeature Selection by Joint Graph Sparse Coding
This paper takes manifold learning and regression simultaneously into account to perform unsupervised spectral feature selection. We first extract the bases of the data, and then represent the data sparsely using the extracted bases by proposing a novel joint graph sparse coding model, JGSC for short. We design a new algorithm TOSC to compute the resulting objective function of JGSC, and then t...
متن کاملSparse graph-based transduction for image classification
Sparse Representation (SR) shows powerful discriminating power when the training samples are sufficient to construct an overcomplete dictionary. However, in the lack of training samples case, the dictionary is too small to sparsely represent the test sample which restricts the classification performance of sparse representation. In order to address this problem, we propose a new sparse represen...
متن کاملDesign of Joint Sparse Graph for OFDM (JSG-OFDM) system
Low density signature orthogonal frequency division multiplexing (LDS-OFDM) and low density parity-check (LDPC) codes are multiple access and forward error correction (FEC) techniques, respectively. Both of them can be expressed by a bipartite graph. In this paper, we construct a joint sparse graph combining the single graphs of LDS-OFDM and LDPC codes, namely joint sparse graph for OFDM (JSG-O...
متن کاملSparse Reliable Graph Backbones
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independently with probability pe. In this paper it is shown that every n-vertex graph contains a sparse backbone, i.e., a spanning subgraph with O(n log n) edges whose reliability is at least (1−n−Ω(1)) times that ofG. Moreove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2018
ISSN: 2169-3536
DOI: 10.1109/access.2018.2828126